-adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation
نویسندگان
چکیده
منابع مشابه
Parallelism and Concurrency Theorems for Rules with Nested Application Conditions
We present Local Church-Rosser, Parallelism, and Concurrency Theorems for rules with nested application conditions in the framework of weak adhesive HLR categories including different kinds of graphs. The proofs of the statements are based on the corresponding statements for rules without application conditions and two Shift-Lemmas, saying that nested application conditions can be shifted over ...
متن کاملParallelism and Concurrency in Adhesive High-Level Replacement Systems with Negative Application Conditions
The goal of this paper is the generalization of parallelism and concurrency results for adhesive High-Level Replacement (HLR) systems to adhesive HLR systems with negative application conditions. These conditions restrict the application of a rule by expressing that a specific structure should not be present before or after applying the rule to a certain context. Such a condition influences thu...
متن کاملNested Loop Transformation for Full Parallelism
Transformation techniques are usually applied to get optimal execution rates in parallel and/or pipeline systems. The retiming technique is a common and valuable tool in onedimensional problems. Most scienti c or DSP applications are recursive or iterative. Uniform nested loops can be modeled as multi-dimensional data ow graphs (DFGs). To achieve full parallelism of the loop body, i.e., all the...
متن کاملAnalysis of permutation equivalence in -adhesive transformation systems with negative application conditions
M-adhesive categories provide an abstract framework for a large variety of specification frameworks for modelling distributed and concurrent systems. They extend the well-known frameworks of adhesive and weak adhesive HLR categories and integrate high-level constructs like attribution as in the case of typed attributed graphs. This article presents M-adhesive transformation systems including ne...
متن کاملCorrectness of high-level transformation systems relative to nested conditions
We introduce the notions of nested constraints and application conditions, short nested conditions. For a category associated with a graphical representation such as graphs, conditions are a graphical and intuitive, yet precise formalism, well-suited to describe structural properties. We show that nested graph conditions are expressively equivalent to first-order graph formulas. A part of the p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Structures in Computer Science
سال: 2014
ISSN: 0960-1295,1469-8072
DOI: 10.1017/s0960129512000357